Content item retrieval based on a free text entry

ABSTRACT

A method and apparatus for textual searching of a database is provided herein. During operation a user will input a letter into a search engine. The search engine will score words based on the letter and display results of the highest-scored words. Another letter will again be received and the process repeated. In situations where titles are returned to the user, additional steps of associating the words with a title and scoring the title take place. The highest-scored titles are provided to the user as the displayed results.

FIELD OF THE INVENTION

The present invention relates generally to textual searching of databases and in particular, to content item retrieval from databases based on a text entry.

BACKGROUND OF THE INVENTION

The use of many electronic devices capable of searching databases has become widespread. For example, a television set-top box used as a multi-media device often has the capability of searching an electronic program guide (EPG) based on a textual input. Often times the searches require large strings of text to be input by the user. The shift of focus across the screen takes time for motor, visual, cognitive processing. This time-consuming process may lead to input error. Therefore a need exists for a method and apparatus for textual searching of databases on electronic devices that is robust to input errors and minimizes the amount of input efforts required from a user.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram showing an apparatus used for text entry.

FIG. 2 is a flow chart showing the operation of the apparatus of FIG. 1.

Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions and/or relative positioning of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments of the present invention. Also, common but well-understood elements that are useful or necessary in a commercially feasible embodiment are often not depicted in order to facilitate a less obstructed view of these various embodiments of the present invention. It will further be appreciated that certain actions and/or steps may be described or depicted in a particular order of occurrence while those skilled in the art will understand that such specificity with respect to sequence is not actually required. Those skilled in the art will further recognize that references to specific implementation embodiments such as “circuitry” may equally be accomplished via replacement with software instruction executions either on general purpose computing apparatus (e.g., CPU) or specialized processing apparatus (e.g., DSP). It will also be understood that the terms and expressions used herein have the ordinary technical meaning as is accorded to such terms and expressions by persons skilled in the technical field as set forth above except where different specific meanings have otherwise been set forth herein.

DETAILED DESCRIPTION OF THE DRAWINGS

In order to alleviate the above-mentioned need, a method and apparatus for textual searching of a database is provided herein. During operation a user will input a letter into a search engine. The search engine will score words based on the letter and display results of the highest-scored words. Another letter will again be received and the process repeated. In situations where titles are returned to the user, additional steps of associating the words with a title and scoring the title take place. The highest-scored titles are provided to the user as the displayed results.

When scoring words, a technique is utilized that does not require a user to enter a string of characters in an exact order as a word in the database to identify the word in the database. For example, to find an word consisting of the word “six”, user may just enter “s” and “x”. Words are scored a value in proportion to how many letters they have that are similar to the search string. Additionally, words are scored a higher value if they contain letters in an exact order as contained in the search string. So, for example, even though the word “avalanche” and “avenged” both contain the letters “v” and “a”, the word “avalanche” will be scored higher if the search string is “va”, while the word “avenged” will be scored higher if the search string is “av”.

The above technique provides users with a convenient way to search a database that allows minimal textual input, which allows user to input characters in free format in a very casual manner to reduce attention demands and while not distracting focus of the attention from entertainment. A user can enter a distinctive letter string as conceived in the user's mind to quickly identify the searched items. Unlike predictive text entry, (which requires the correct spelling to find the items), the above technique may be able to allow users to minimize the keys used for text entry.

Turning now to the drawings, where like numerals designate like components, FIG. 1 is a block diagram showing apparatus 100 used for text entry. Apparatus 100 may be incorporated into any electronic device that is capable of searching databases. Such devices include, but are not limited to TV set-top boxes, cellular telephones, Personal Digital Assistants (PDAs), personal computers, . . . , etc.

As shown, apparatus 100 comprises an electronic processor 101 and database 102. Processor 101 comprises logic circuitry such as a digital signal processor (DSP), general purpose microprocessor, a programmable logic device, or application specific integrated circuit (ASIC) and is utilized to search database 102. Database 102 comprises standard random access memory and is used to store information that can be textually searched. Such information includes, but is not limited to electronic program guides (EPGs), song titles, photo tagged by text, etc.

During operation of apparatus 100, textual input is received by processor 101. The textual input may be from a keyboard, a voice command, a pointing device, or any other means for providing letters to processor 101. In response, processor 101 will score words within database 102. As discussed above, processor 101 will score words based on the letter received and display results of the highest-scored words. Another letter will again be received and the process repeated. In situations where titles are returned to the user, additional steps of associating the words with a title and scoring the title take place. The highest-scored titles are provided to the user as the displayed results.

Scoring Words

As discussed above, when scoring words, a technique is utilized that does not require a user to enter a string of characters in an exact order as contained within a word the database to identify the word in the database. For example, to find an item consisting of the word “six”, user may just enter “s” and “x” on the soft keyboard on the screen. Words are scored a value in proportion to how many letters they have that are similar to the search string (textual input). Additionally, words are scored a higher value if they contain letters in an exact order as contained in the search string. So, for example, even though the word “avalanche” and “avenged” both contain the letters “v” and “a”, the word “avalanche” will be scored higher if the search string is “va”, while the word “avenged” will be scored higher if the search string is “av”.

Other examples are:

The search string “nn” can return words “cnn” and “thinner”

The search string “fer” can return the word “winfery”

The search string “nnoo” can return words “look” and “thinner”

The search string “kll” can return word “Kelly”

The search string “ssx” can return words “six”

The scoring of words takes place by initializing a score accumulator (sword) to zero. For the current input letter, strings of single letter, bi-letter, tri-letter, etc are formed by pre-pending the previously-supplied inputs. The match of an M-letter string at depth x produces a score of μ_(M)(x). Thus, the match of a single letter in a word at depth x produces a score μ₁(x). The match of a bi-letter in a word at depth x produces a bi-letter score μ₂(x), and so on. With the above in mind:

sword=sword*f+(μ₁(x)+μ₂(x)+ . . . +μ_(n)n(x)).

Where:

f is a forgetting factor to gradually discount the contribution of past inputs. For example, if f=1, there is no forgetting factor. If forgetting factor is used we set f=0.97. Alternatively,

sword=μ₁(x)+μ₂(x)+ . . . +μ_(n)(x).

So, for example, if for a single input letter of “s”, the following score would be returned:

Word Score Shoe μ₁(1) Basket μ₁(3) Sneakers μ₁(1) + μ₁(8) Baseballs μ₁(3) + μ₁(9)

For a double letter input of “sc”, the following score would be returned:

Word Score soccer μ₁(1) + μ₁(3) + μ₁(4) sample μ₁(1) screen μ₁(1) + μ₁(2) + μ₂(1) screws μ₁(1) + μ₁(2) + μ₂(1) + μ₁(6)

Considering that a higher score represents a better match of a search string with a particular word, the values for μ_(M)(x) are chosen to increase as M increases, and decrease as x increases. Thus, the value for μ_(M)(x) is proportional to M and inversely proportional to x. Some sample values for μ_(M)(x) are given below with all numerical values being exemplary in nature:

x M 1 2 3 4 1 μ₁(1) = 3 μ₁(1) = 2 μ₁(1) = 1.6 μ₁(1) = 1.5 2 μ₂(1) = 0 μ₂(2) = 11 μ₂(2) = 10.6 μ₂(2) = 10.5 The score for a particular word can be also estimated from the letter-word occurrences based on the database and heuristics on human behavior modeling. The score can be further processed by a function such as normalization by the number of letters in the word.

Scoring Titles

As discussed above, titles may be returned to the user of apparatus 100. When returning titles (e.g., EPG show titles), the score for the words are converted into scores for titles. As an example:

The search string “nn” can return titles “cnn”, “look thinner”

The search string “fer” can return title “opera winfery”

The search string “nnoo” can return title “look thinner”

The search string “kll” can return title “Live With Regis and Kelly”

The search string “ssx” can return title “six sense”

A number of highest-scored titles are presented to the user. A score for each title (tscore) comprises a function of individual word scores, and is determined by first setting tscore to zero. Then for each of the N words in the title (w₁, w₂, . . . , w_(N)), Tscore is calculated as:

${Tscore} = \left( {{\sum\limits_{n = 1}^{N}{{sword}\left( w_{n} \right)}} + {\beta*{\log\left( {Z/{i\left( w_{n} \right)}} \right)}}} \right.$

Where i(w_(n)) is a number of titles having the word w_(n,), Z is the size of titles in the database and β is determined experimentally to control the reward score given to words appearing less often across the selected titles. For example, β=10.

Alternatively, Tscore may simply comprise a summation of the individual word (w₁, w₂, . . . , w_(N)) scores in the title, so that:

${Tscore} = {\sum\limits_{n = 1}^{N}{{{sword}\left( w_{n} \right)}{\text{)}.}}}$

FIG. 2. is a flow chart showing the operation of the apparatus of FIG. 1. As discussed above, apparatus 100 comprises processor 101 for determining search results based on textual input, and database 102. Database 102 comprises a plurality of words, and optionally comprises a plurality of titles derived from the words.

The logic flow begins at step 201 where processor 101 receives a textual input (search string). Processor 101 appends the current input onto any existing input at step 203 to form an updated search string, and the logic flow continues to step 205. At step 205 database 102 is accessed by processor 101 and all words within database 102 are scored by processor 101 based on the current input and any existing input.

Each word within database 102 receives a score proportional to a number of letters within the search string and the depth of the string within the word. As discussed above, the score of each word comprises a summation of a score for each letter in the textual input, along with a summation of a score for each combination of letters in the search string. Thus, if a textual input comprises “xyz” each word within database will receive a summation score that is a summation of the score for “x”, the score for “y”, the score for “z”, the score for “xy”, the score for “yz”, and the score for “xyz”. Additionally each word's score for a particular string is proportional to a number of letters within the string (M) and the depth of the string (x) within the word.

At this point in the logic flow (step 207), processor 101 may output the highest scored words as a search result, however, if titles are to be returned as a search result, then the logic flow skips step 207 and proceeds directly to step 209 where each title within the database is scored by processor 101. As discussed above, each title comprise a plurality of scored words, and a score for each title is proportional to a summation of the individual scores of each word in the title. A score for each title (tscore) is determined by summing over the individual word (w₁, w₂, . . . , w_(N)) scores in the title. Thus, the score for each title is proportional to the individual scores of each word in the title. Finally, at step 211 search results comprising titles are output by processor 101. The logic flow then returns to step 201 where processor awaits another letter to append to the search string (textual input).

While the invention has been particularly shown and described with reference to a particular embodiment, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention. It is intended that such changes come within the scope of the following claims: 

1. A method for content item retrieval based on text entry, the method comprising the steps of: receiving by an electronic processor, a textual input (search string); accessing by the electronic processor, a database comprising a plurality of words; and determining by the electronic processor, a score for words from the database based on the textual input, wherein a score for each word is proportional to a number of letters within the search string and the depth of the string within the word.
 2. The method of claim 1 further comprising the step of: outputting by the electronic processor, a plurality of words having a highest score.
 3. The method of claim 1 further comprising the steps of: determining, by the electronic processor, scores for a plurality of titles within the database, wherein each title comprise a plurality of scored words, and wherein a score for each title is proportional to a summation of the individual scores of each word in the title.
 4. The method of claim 3 further comprising the step of: outputting by the electronic processor, a plurality of titles having a highest score.
 5. A method comprising the steps of: receiving by an electronic processor, a textual input; appending the textual input to a previously supplied textual input to form a search string; accessing by the electronic processor, a database comprising a plurality of words; and determining by the electronic processor, a score (sword) for words in the database based on the search string, wherein sword=(μ₁(x)+μ₂(x)+ . . . +μ_(n)(x), where a match of an M-letter search string at depth x in a word produces a score of μ_(M)(x).
 6. The method of claim 5 wherein sword=sword*f+(μ₁(x)+μ₂(x)+ . . . +μ_(n)(x)), where f is a forgetting factor to gradually discount the contribution of past inputs.
 7. The method of claim 5 further comprising the steps of: determining, by the electronic processor, scores (Tscore) for a plurality of titles within the database, wherein a title within the database comprises a plurality of scored words, and wherein a score for each title is proportional to a summation of individual scores of each word in the title.
 8. The method of claim 7 wherein for each of N words in the title (w₁, w₂, . . . , w_(N)), Tscore is calculated as: ${Tscore} = \left( {{{\sum\limits_{n = 1}^{N}{{sword}\left( w_{n} \right)}} + {\beta*{\log\left( {Z/{i\left( w_{n} \right)}} \right)}}},{where}} \right.$ i(w_(n)) is a number of titles having the word w_(n,), Z is a size of titles in the database and β is determined experimentally to control a reward score given to words appearing less often across titles.
 9. The method of claim 7 wherein for each of N words in the title (w₁, w₂, . . . , w_(N)), Tscore is calculated as: ${Tscore} = {\sum\limits_{n = 1}^{N}{{{sword}\left( w_{n} \right)}{\text{)}.}}}$
 10. An apparatus comprising: a database comprising a plurality of words; a processor receiving a textual input (search string) and determining a score for words (sword) from database based on the search string, wherein a score for each word is proportional to a number of letters within the search string and the depth of the search string within the word.
 11. The apparatus of claim 10 wherein the processor outputs a plurality of words having a highest score.
 12. The apparatus of claim 10 wherein: the processor scores a plurality of titles within the database, wherein titles within the database comprise a plurality of scored words, and wherein a score for each title is proportional to a summation of the individual scores of each word in the title.
 13. The apparatus of claim 12 wherein the processor outputs a plurality of titles having a highest score.
 14. The apparatus of claim 12 wherein for each of N words in a title (w₁, w₂, . . . , w_(N)), Tscore for the title is calculated as: ${Tscore} = \left( {{{\sum\limits_{n = 1}^{N}{{sword}\left( w_{n} \right)}} + {\beta*{\log\left( {Z/{i\left( w_{n} \right)}} \right)}}},{where}} \right.$ i(w_(n)) is a number of titles having the word w_(n,), Z is a size of titles in the database and β is determined experimentally to control a reward score given to words appearing less often across the titles.
 15. The apparatus of claim 12 wherein for each of N words in a title (w₁, w₂, . . . , w_(N)), Tscore for the title is calculated as: ${Tscore} = {\sum\limits_{n = 1}^{N}{{{sword}\left( w_{n} \right)}{\text{)}.}}}$
 16. The apparatus of claim 10 wherein a score (sword) for each word is based on the search string, and wherein sword=(μ₁(x)+μ₂(x)+ . . . +μ_(n)(x), where a match of an M-letter string at depth x in a word produces a score of μ_(M)(x). 